Track Detection Algorithm Based on Trace Correlation Using Hough Transform

نویسندگان

چکیده

Introduction . Track detection is one of the main tasks to be solved in trajectory processing. This task can efficiently using Hough Transform. A track considered detected if number position measurements received a consecutive radar scans and falling into same cell parameter space (accumulator) has exceeded threshold. However, effective practical application transform requires sufficiently long time measurement. Under small given for detection, are also accumulated those accumulator cells where their traces intersect. Therefore, order detect true tracks, additional processing required distinguish measurement clusters from different targets based on geometric proximity. In addition, large amount memory computational operations maintenance significantly increase computation load processor. Aim To design simple false-detection resilient algorithm detecting tracks without processor memory. Materials methods proposed algorithm, construction followed by selection with largest passed through them replaced cross correlations clustering maximum similarity traces. Results Mathematical simulation scenario parameters selected paper confirmed accuracy all existing field view its efficiency conducting error free association target measurements. Conclusion was created transform. The does not require

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Circular arc detection based on Hough transform

A new method is proposed to detect circular arcs. The detection of a circular arc includes the determination of its center, radius, length, and midpoint. The Hough transform is applied to detect circular arcs by using center and radius as parameters. A peak value in the parameter space of the Hough transform indicates the existence of a circular arc. The center and radius of the circular arc ar...

متن کامل

Global Correlation Clustering Based on the Hough Transform

In this article, we propose an efficient and effective method for finding arbitrarily oriented subspace clusters by mapping the data space to a parameter space defining the set of possible arbitrarily oriented subspaces. The objective of a clustering algorithm based on this principle is to find those among all the possible subspaces that accommodate many database objects. In contrast to existin...

متن کامل

Face Detection Using Scan-Line Based Hough Transform and MLP

A face boundary can be approximated by an ellipse with five-dimensional parameters. This property allows an ellipse detection algorithm to be adapted to detecting faces. However, the construction of a huge five-dimensional parameter space for a Hough transform is quite unpractical. Accordingly, we propose a scan-line-based Hough transform (SLHT) method for detecting faces from a symmetric conto...

متن کامل

Implementing Rectangle Detection using Windowed Hough Transform

This paper implements Jung and Schramm’s method to use Hough Transform for rectangle recognition using a few pre processing methods and performing a windowed application so that the the algorithm can perform faster. Images are scanned with a sliding Hough transform window, peaks of the transform are extracted(which correspond to line segments) and rectangles are detected based on a certain geom...

متن کامل

EDGE Detection Techniques Using Hough Transform

Image processing is an area characterized by the need for extensive experimental wok to establish the viability of proposed solution. Interpretation of image contents is one of the objectives in computer vision specifically in image processing. In this era it has received much awareness of researchers. This paper we present different edge detection technique’s using Hough transform, because edg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Izvestiâ vysših u?ebnyh zavedenij Rossii

سال: 2023

ISSN: ['2658-4794', '1993-8985']

DOI: https://doi.org/10.32603/1993-8985-2023-26-2-65-77